Securing Distance-vector Routing Protocols Securing Distance-vector Routing Protocols

نویسندگان

  • Bradley R. Smith
  • Darrell D. E. Long
  • Pat Mantey
چکیده

The security requirements of distance-vector routing protocols are analyzed, their vulnerabilities identi ed, and countermeasures to these vulnerabilities are proposed. The innovation presented involves the use of mechanisms from the pathnding class of distancevector protocols as a solution to the security problems of distance-vector protocols. The result is the rst proposal to e ectively and e ciently secures distance-vector protocols in constant space.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Security Mechanisms for Routing Protocols

As our economy and critical infrastructure increasingly rely on the Internet, securing routing protocols becomes of critical importance. In this paper, we present four new mechanisms as tools for securing distance vector and path vector routing protocols. For securing distance vector protocols, our hash tree chain mechanism forces a router to increase the distance (metric) when forwarding a rou...

متن کامل

Securing Distance-Vector Routing Protocols

We analyze the security requirements of distance-vector routing protocols, identify their vulnerabilities, and propose countermeasures to these vulnerabilities. The innovation we propose involves the use of mechanisms from the path-finding class of distance-vector protocols as a solution to the security problems of distance-vector protocols. The result is a proposal that effectively and efficie...

متن کامل

Efficient Security Mechanisms for Routing Protocolsa

As our economy and critical infrastructure increasingly rely on the Internet, securing routing protocols becomes of critical importance. In this paper, we present four new mechanisms as tools for securing distance vector and path vector routing protocols. For securing distance vector protocols, our hash tree chain mechanism forces a router to increase the distance (metric) when forwarding a rou...

متن کامل

Leveraging a Minimal Trusted Computing Base for Securing On-Demand MANET Routing Protocols

We propose an approach to secure on-demand mobile ad hoc network (MANET) routing protocols by leveraging low-complexity trustworthy MANET modules (TMM). Such TMMs, which perform some trivial hard-wired functions involving simple logical and hash operations, can be realized at low cost. We describe the functionality of such TMMs to offer a sound trusted computing base (TCB) for securing MANETs. ...

متن کامل

Babel

Routing and switching capabilities of computer networks seem as the closed environment containing a limited set of deployed protocols, which nobody dares to change. The majority of wired network designs are stuck with OSPF (guaranteeing dynamic routing exchange on network layer) and RSTP (securing loop-free data-link layer topology). Recently, more use-case specific routing protocols, such as B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997